A New Criterion of Decidability for Intermediate Logics
نویسنده
چکیده
In this paper I study Lukasiewicz-style refutation procedures (cf. [8], also [3]) for intermediate logics as a method of obtaining decidability results. This method proves to be more general than Harrop’s criterion (cf. [4]) saying that every finitely axiomatizable logic with the finite model property is decidable. There are 2א0 intermediate logics without the f.m.p. (cf. [1], [2]). I give a more general criterion of decidability applicable also to some of those logics.
منابع مشابه
One-step Heyting Algebras and Hypersequent Calculi with the Bounded Proof Property
We investigate proof-theoretic properties of hypersequent calculi for intermediate logics using algebraic methods. More precisely, we consider a new weakly analytic subformula property (the bounded proof property) of such calculi. Despite being strictly weaker than both cut-elimination and the subformula property this property is sufficient to ensure decidability of finitely axiomatised calculi...
متن کاملCoalgebraic Hybrid Logic
We introduce a generic framework for hybrid logics, i.e. modal logics additionally featuring nominals and satisfaction operators, thus providing the necessary facilities for reasoning about individual states in a model. This framework, coalgebraic hybrid logic, works at the same level of generality as coalgebraic modal logic, and in particular subsumes, besides normal hybrid logics such as hybr...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملOn PSPACE-decidability in Transitive Modal Logics
In this paper we describe a new method, allowing us to prove PSPACE-decidability for transitive modal logics. We apply it to L1 and L2, modal logics of Minkowski spacetime. We also show how to extend this method to some other transitive logics.
متن کاملAPPLICATION OF THE BELLMAN AND ZADEH'S PRINCIPLE FOR IDENTIFYING THE FUZZY DECISION IN A NETWORK WITH INTERMEDIATE STORAGE
In most of the real-life applications we deal with the problem of transporting some special fruits, as banana, which has particular production and distribution processes. In this paper we restrict our attention to formulating and solving a new bi-criterion problem on a network in which in addition to minimizing the traversing costs, admissibility of the quality level of fruits is a main objecti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005